package practice3;

import java.util.Scanner;

public class P8697_2 {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();
        int m = S.length();
        int n = T.length();
        int[][] dp = new int[m+1][n+1];
        for(int i=1;i<=m;i++){
            for(int j=1;j<=n;j++){
                if(S.charAt(i-1) == T.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1]+1;
                }else{
                    dp[i][j] = Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        System.out.println(dp[m][n]);
    }
}
